Group Construction of Covering Arrays
نویسندگان
چکیده
A covering array t-CAðn; k; gÞ is a k n array on a set of g symbols with the property that in each t n subarray, every t 1 column appears at least once. This paper improves many of the best known upper bounds on n for covering arrays, 2-CAðn; k; gÞ with gþ 1 k 2g, for g 1⁄4 3 12 by a construction which in many of these cases produces a 2-CAðn; k; gÞ with n 1⁄4 kðg 1Þ þ 1. The construction is an extension of an algebraic method used by Chateauneuf, Colbourn, and Kreher which uses an array and a group action on the array. # 2004 Wiley Periodicals, Inc. J Combin Designs 13: 70–77, 2005
منابع مشابه
Profiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملStrength two covering arrays: Existence tables and projection
A covering array CA(N; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used in experiments to screen for interactions among t-subsets of k components. Strength two covering arrays have been studied from numerous viewpoints, resulting in a variety of computational, direct, and...
متن کاملProducts of Mixed Covering Arrays of Strength Two
A covering array CA(N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial construc...
متن کاملConstructing new covering arrays from LFSR sequences over finite fields
Let q be a prime power and Fq be the finite field with q elements. A q-ary m-sequence is a linear recurrence sequence of elements from Fq with the maximum possible period. A covering array CA(N ; t, k, v) of strength t is a N ×k array with entries from an alphabet of size v, with the property that any N×m subarray has at least one row equal to every possible m-tuple of the alphabet. The coverin...
متن کاملCovering arrays from cyclotomy
For a prime power q ≡ 1 (mod v), the q × q cyclotomic matrix, whose entries are the discrete logarithmsmodulo v of the entries in the addition table of Fq , has been shown using character theoretic arguments to produce an ε-biased array, provided that q is large enough as a function of v and ε. A suitable choice of ε ensures that the array is a covering array of strength t when q > t2v4t . On t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004